Extended Lattice Reduction Experiments Using the BKZ Algorithm
نویسندگان
چکیده
We present experimental results using lattice reduction algorithms. We choose the BKZ algorithm, that is the algorithm considered the strongest one in this area in practice. It is an important task to analyze the practical behaviour of lattice reduction algorithms, as the theoretical predictions are far from being practical. Our work helps choosing the right parameters for lattice reduction in practice. The experiments in this paper go beyond the results of Gama and Nguyen in their Eurocrypt 2008 paper. We give evidence of some facts stated in their work, concerning the runtime and the output quality of lattice reduction algorithms.
منابع مشابه
The BKZ Simulation Algorithm
The best reduction algorithm for lattices with high dimensions known today is the BKZ reduction algorithm by Schnorr and Euchner. The running time of the BKZ reduction algorithm, however, increases significantly with higher blocksizes. The BKZ simulation algorithm by Chen and Nguyen predicts the Gram-Schmidt norms of a lattice basis after a given time of rounds of BKZ reduction. Given the cost ...
متن کاملBKZ 2.0: Better Lattice Security Estimates
The best lattice reduction algorithm known in practice for high dimension is Schnorr-Euchner’s BKZ: all security estimates of lattice cryptosystems are based on NTL’s old implementation of BKZ. However, recent progress on lattice enumeration suggests that BKZ and its NTL implementation are no longer optimal, but the precise impact on security estimates was unclear. We assess this impact thanks ...
متن کاملSecond Order Statistical Behavior of LLL and BKZ
The LLL algorithm (from Lenstra, Lenstra and Lovász) and its generalization BKZ (from Schnorr and Euchner) are widely used in cryptanalysis, especially for lattice-based cryptography. Precisely understanding their behavior is crucial for deriving appropriate key-size for cryptographic schemes subject to lattice-reduction attacks. Current models, e.g. the Geometric Series Assumption and Chen-Ngu...
متن کاملA Measure Version of Gaussian Heuristic
Most applicable lattice reduction algorithms used in practice are BKZ (Block-Korkine-Zolotarev) type algorithms as the blockwise generalizations of the LLL algorithm (Lenstra-Lenstra-Lovasz). Its original version was proposed by Schnorr and Euchner in 1991. The quality of reduced lattice bases is measured by the Hermitian factor ||b1|| vol(L)1/d and the d-th root of this factor which is called ...
متن کاملImproved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
In this paper, we investigate a variant of the BKZ algorithm, called progressive BKZ, which performs BKZ reductions by starting with a small blocksize and gradually switching to larger blocks as the process continues. We discuss techniques to accelerate the speed of the progressive BKZ algorithm by optimizing the following parameters: blocksize, searching radius and probability for pruning of t...
متن کامل